A Restarted Lanczos Approximation to Functions of a Symmetric Matrix
نویسندگان
چکیده
Abstract. In this paper, we investigate a method for restarting the Lanczos method for approximating the matrix-vector product f(A)b, where A ∈ Rn×n is a symmetric matrix. For analytic f we derive a novel restart function that identifies the error in the Lanczos approximation. The restart procedure is then generated by a restart formula using a sequence of these restart functions. We present an error bound for the proposed restart scheme. We also present an error bound for the restarted Lanczos approximation of f(A)b for symmetric positive definite A when f is in a particular class of completely monotone functions. We illustrate for some important matrix function applications the usefulness of these bounds for terminating the restart process once the desired accuracy in the matrix function approximation has been achieved.
منابع مشابه
An Implicitly Restarted Lanczos Method for Large Symmetric Eigenvalue Problems
The Lanczos process is a well known technique for computing a few, say k, eigenvalues and associated eigenvectors of a large symmetric n×n matrix. However, loss of orthogonality of the computed Krylov subspace basis can reduce the accuracy of the computed approximate eigenvalues. In the implicitly restarted Lanczos method studied in the present paper, this problem is addressed by fixing the num...
متن کاملThe Radau-Lanczos Method for Matrix Functions
Analysis and development of restarted Krylov subspace methods for computing f(A)b have proliferated in recent years. We present an acceleration technique for such methods when applied to Stieltjes functions f and Hermitian positive definite matrices A. This technique is based on a rank-one modification of the Lanczos matrix derived from a connection between the Lanczos process and Gauss–Radau q...
متن کاملTRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
The Lanczos method is one of the standard approaches for computing a few eigenpairs of a large, sparse, symmetric matrix. It is typically used with restarting to avoid unbounded growth of memory and computational requirements. Thick-restart Lanczos is a popular restarted variant because of its simplicity and numerically robustness. However, convergence can be slow for highly clustered eigenvalu...
متن کاملThick-Restart Lanczos Method for Symmetric Eigenvalue Problems
For real symmetric eigenvalue problems, there are a number of algorithms that are mathematically equivalent, for example, the Lanczos algorithm, the Arnoldi method and the unpreconditioned Davidson method. The Lanczos algorithm is often preferred because it uses signiicantly fewer arithmetic operations per iteration. To limit the maximum memory usage, these algorithms are often restarted. In re...
متن کاملTwo-stage spectral preconditioners for iterative eigensolvers
In this paper we present preconditioning techniques to accelerate the convergence of Krylov solvers at each step of an Inexact Newton’s method for the computation of the leftmost eigenpairs of large and sparse symmetric positive definite matrices arising in large scale scientific computations. We propose a two-stage spectral preconditioning strategy: the first stage produces a very rough approx...
متن کامل